Cryptanalysis and Improvement of Selvi et al.'s Identity-Based Threshold Signcryption Scheme

نویسندگان

  • Wei Yuan
  • Liang Hu
  • Hongtu Li
  • Jianfen Chu
  • Yuyu Sun
چکیده

Signcryption can realize the function of encryption and signature in a reasonable logic step, which can lower computational costs and communication overheads. In 2008, S. S. D. Selvi et al. proposed an identitybased threshold signcryption scheme. In this paper, we show that the threshold signcryption scheme of S. S. D. Selvi et al. is vulnerable if the attacker can replaces the group public key. Then we point out that the receiver uses the senders’ public key without any verification in the unsigncrypt stage cause this attack. Further, we propose a probably-secure improved scheme to correct the vulnerable and give the unforgeability and confidentiality of our improved scheme under the existing security assumption.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Security of ID Based Signcryption Schemes

A signcryption scheme is secure only if it satisfies both the confidentiality and the unforgeability properties. All the ID based signcryption schemes presented in the standard model till now do not have either the confidentiality or the unforgeability or both of these properties. Cryptanalysis of some of the schemes have been proposed already. In this work, we present the security attack on ‘S...

متن کامل

Certificateless aggregate signcryption: Security model and a concrete construction secure in the random oracle model

Certificateless cryptography; Aggregate signcryption; Random oracle model; Bilinear pairing Abstract The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397]. The aggregation process of these schemes reduces the amount of exchanged information and is particul...

متن کامل

On the Provable Security of Multi-Receiver Signcryption Schemes

In ATC 2007, an identity based signcryption scheme for multiple receivers was proposed by Yu et al. In this paper, we first show that Yu et al.’s signcryption scheme is insecure by demonstrating an universal forgeability attack anyone can generate a valid signcryption on any message on behalf of any legal user for any set of legal receivers without knowing the secret keys of the legal users. Al...

متن کامل

Cryptanalysis of an Identity Based Signcryption Scheme without Random Oracles

Signcryption is a cryptographic primitive that aims at providing confidentiality and the sender’s identity authentication in a logic step, at lower computational costs and communication overheads than sign-then-encrypt way. Recently, Yu et al.[1] proposed a new identity based signcryption scheme in standard model. However, in this paper, we show that the scheme still has some security weaknesse...

متن کامل

A supplement to Liu et al.'s certificateless signcryption scheme in the standard model

Recently, Liu et al. proposed the first certificateless signcryption scheme without random oracles and proved it was semantically secure in the standard model. However, Selvi et al. launched a fatal attack to its confidentiality by replacing users’ public keys, thus pointed out this scheme actually doesn’t reach the semantic security as claimed. In this paper, we come up with a rescue scheme ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JNW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011